[20251213] BOJ / G5 / 진우의 달 여행 (Large) / 이준희 #1660
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/17485
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
진우가 달을 가고 싶은데 달로 가능 방향은
좌하단, 하단, 우하단만 가능하며 연속으로 같은 방향으로는 갈 수 없습니다.
이 때 각 맵에 필요한 연료가 주어질 때
가장 낮은 연료로 갈 수 있는 경우를 구하는 문제입니다.
🔍 풀이 방법
DP를 이용해서 풀었습니다.
맵 크기만큼의 DP 배열에 내려가는 경우의 수를 3차원으로 하여 풀었습니다.
⏳ 회고
기본적인 DP 문제였습니다.